Semi-on-line multiprocessor scheduling with given total processing time
نویسندگان
چکیده
منابع مشابه
Semi-on-line multiprocessor scheduling with given total processing time
We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with perform...
متن کاملLower Bounds and Semi On-line Multiprocessor Scheduling
We are given a set of identical machines and a sequence of jobs from which we know the sum of the job weights in advance. The jobs have to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. This improves recent results by Azar and Regev who published an algorithm with performanc...
متن کاملOn-line Multiprocessor Tasks Scheduling with Rejection
This paper deals with multiprocessor task scheduling with ready times, due dates and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by given ready times, respecting their due dates. Moreover, a task can be examined in order to be processed only when it enters the scheduler. The concept of rejection is int...
متن کاملSemi-on-line Parallel Machines Scheduling under Known Total and Largest Processing Times
We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is not more than √ 10 3 ≈ 1.8257, regardless of the number of machines.
متن کاملSemi-Partitioning Technique for Multiprocessor Real-Time Scheduling
A semi-partitioning technique is presented for efficient scheduling of sporadic task systems on multiprocessors. The presented technique performs in the same manner as the traditional partitioning, as long as tasks are successfully partitioned, but a task is allowed to be shared among multiple processors for its execution, if a spare capacity of every individual processor is not enough to accep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.11.018